Deciding conjugacy in sylvester monoids and other homogeneous monoids

نویسندگان

  • Alan J. Cain
  • António Malheiro
چکیده

Acknowledgements: During the research that led to the this paper, the first author was initially supported by the European Regional Development Fund through the programme  and by the PortugueseGovernment through the  (Fundação para a Ciência e a Tecnologia) under the project -/// and through an  Ciência  fellowship, and later supported by an  Investigador advanced fellowship. For the second author, this work was developed within the project -/// of CAUL, FCUL.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids

This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and Sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and Güzel Karpuz; we then ...

متن کامل

Decidability and Independence of Conjugacy Problems in Finitely Presented Monoids

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by ∼p, ∼o, and ∼c) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, p-conjugacy is “almost” transitive, ∼c is stric...

متن کامل

Conjugacy in Special Monoids

A monoid is special if it is presented by a set of relations of the form r = e. This paper investigates the problem of conjuacy in special monoids. After showing that the different concepts of conjugacy become identical in special monoids, which gives an affirmative answer to an open problem in 171, we prove that the conjugacy problem is decidable for some restricted classes of special monoids....

متن کامل

Applying rewriting methods to special monoids

Introduction A special monoid is a monoid presented by generators and defining relations of the form w = e, where w is a non-empty word on generators and e is the empty word. Groups are special monoids. But there exist special monoids that are not groups. Special monoids have been extensively studied by Adjanfl] and Makanin[7] (see also [2]). The present paper is a sequel to [11]. In [11], we s...

متن کامل

-torsion free Acts Over Monoids

In this paper firt of all we introduce a generalization of torsion freeness of acts over monoids, called -torsion freeness. Then in section 1 of results we give some general properties and in sections 2, 3 and 4 we give a characterization of monoids for which this property of their right Rees factor, cyclic and acts in general  implies some other properties, respectively.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJAC

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2015